Natural Gas Flow Solvers Using Convex Relaxation
نویسندگان
چکیده
منابع مشابه
Numerical simulation of transient natural gas flow in pipelines using high order DG-ADER scheme
To increase the numerical accuracy in solving engineering problems, either conventional methods on a fine grid or methods with a high order of accuracy on a coarse grid can be used. In the present research, the second approach is utilized and the arbitrary high order Discontinues Galerkin Arbitrary DERivative (DG-ADER) method is applied to analyze the transient isothermal flow of natural gas th...
متن کاملOptimization of LDPC Codes Using Convex Relaxation
• low density parity check (LDPC) codes are error correction codes • represented by two probability distributions λ and ρ • desired properties: – high code rate r ∈ R+ → fraction of redundancy present in the code – high noise threshold g ∈ R+ → the largest noise up to which the original code can be reconstructed from its noisy version without any loss of information • LDPC codes can be decoded ...
متن کاملBranch Flow Model for Radial Networks: Convex Relaxation
Power flow optimization is generally nonlinear and non-convex, and a second-order cone relaxation has been proposed recently for convexification. We prove several sufficient conditions under which the relaxation is exact. One of these conditions seems particularly realistic and suggests guidelines on integrating distributed generations.
متن کاملConvex Relaxation of Optimal Power Flow - Part II: Exactness
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملDistributed Asynchronous Relaxation Methods for Convex Network Flow Problems
We consider the solution of the single commodity strictly convex network flow problem in a distributed asynchronous computation environment. The dual of this problem is unconstrained, differentiable, and well suited for solution via Gauss-Seidel relaxation. We show that the structure of the dual allows the successful application of a distributed asynchronous method whereby relaxation iterations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2020
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2020.2972593